Minimizing the Oriented Diameter of a Planar Graph
نویسندگان
چکیده
منابع مشابه
Minimizing the Oriented Diameter of a Planar Graph
We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NPcomplete to decide whether a graph can be oriented so that its diameter is at most two. In contrast to this, for each constant l, we describe an algorithm that decides if a planar graph G has an orientation with diameter at most l and r...
متن کاملThe Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملthe impact of portfolio assessment on iranian efl students essay writing: a process-oriented approach
this study was conducted to investigate the impact of portfolio assessment as a process-oriented assessment mechanism on iranian efl students’ english writing and its subskills of focus, elaboration, organization, conventions, and vocabulary. out of ninety juniors majoring in english literature and translation at the university of isfahan, sixty one of them who were at the same level of writing...
15 صفحه اولOriented diameter and rainbow connection number of a graph
The oriented diameter of a bridgeless graph G is min{diam(H) |H is an orientation of G}. A path in an edge-colored graph G, where adjacent edges may have the same color, is called rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every two distinct vertices of G are...
متن کاملMinimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph
We study the minimum number of label transitions around a given vertex v0 in a planar multigraph G, in which the edges incident with v0 are labelled with integers 1, . . . , l, and the minimum is taken over all embeddings of G in the plane. For a fixed number of labels, a lineartime fixed-parameter tractable algorithm that computes the minimum number of label transitions around v0 is presented....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2009
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.07.043